Local Algorithms for Constructing Spanners: Improved Bounds
نویسندگان
چکیده
Let S be a set of n points in the plane, let E be the complete Euclidean graph whose point-set is S, and let G be the Delauany triangulation of S. We present a very simple local algorithm that constructs a subgraph of G of degree at most 11 that is a geometric spanner of G with stretch factor 2.86. This algorithm gives an O(n lg n) time centralized algorithm for constructing a subgraph of G that is a geometric spanner of E of degree at most 11 and stretch factor < 7. The algorithm can be generalized to unit disk graphs to give a local algorithm for constructing a plane spanner of a unit disk graph of degree at most 11 and stretch factor < 7.
منابع مشابه
On Spanners and Lightweight Spanners of Geometric Graphs
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...
متن کاملLower Bounds for Computing Geometric Spanners and Approximate Shortest Paths
We consider the problems of constructing geometric spanners, possibly containing Steiner points, for sets of points in the d-dimensional space IR d , and constructing spanners and approximate shortest paths among a collection of polygonal obstacles in the plane. The complexities of these problems are shown to be (n log n) in the algebraic computation tree model. Since O(n log n)-time algorithms...
متن کاملHomotopic spanners
We introduce the concept of homotopic spanners in the plane with obstacles and show lower bounds on the number of edges that they require. We also provide a construction based on Θ-graphs for constructing homotopic spanners.
متن کاملConstruction of Minimum-Weight Spanners
Spanners are sparse subgraphs that preserve distances up to a given factor in the underlying graph. Recently spanners have found important practical applications in metric space searching and message distribution in networks. These applications use some variant of the socalled greedy algorithm for constructing the spanner — an algorithm that mimics Kruskal’s minimum spanning tree algorithm. Gre...
متن کاملEfficient Algorithms for Constructing Very Sparse Spanners and Emulators
Miller et al. [MPVX15] devised a distributed1 algorithm in the CONGEST model, that given a parameter k = 1, 2, . . ., constructs an O(k)-spanner of an input unweighted n-vertex graph with O(n) expected edges in O(k) rounds of communication. In this paper we improve the result of [MPVX15], by showing a k-round distributed algorithm in the same model, that constructs a (2k − 1)spanner with O(n/ǫ)...
متن کامل